An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
نویسندگان
چکیده
We present an anonymous, constant-space, self-stabilizing algorithm for finding a 1-maximal independent set in tree graphs (and some rings). We show that the algorithm converges in O(n) moves under an unfair central daemon.
منابع مشابه
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees
We present an anonymous self-stabilizing algorithm for finding a 1-maximal matching in trees, and rings of length not divisible by 3. We show that the algorithm converges in O(n) moves under an arbitrary central daemon.
متن کاملAn Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of length of a multiple of 3 under a central unfair daemon. The 1-maximal matching is a 2 3 -approximation to the maximum matching, and expected to get more matching pairs than a maximal matching, which only guarantees a 1 2 -approximation. The time complexity of t...
متن کاملA Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of a length of a multiple of 3 under a central unfair daemon. Let n and e be the numbers of nodes and edges in a graph, respectively. The time complexity of the proposed algorithm is O(e) moves. Therefore, the complexity is O(n) moves for trees or rings whose lengt...
متن کاملAn Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for anonymous networks without a cycle of a length of a multiple of 3 under a central unfair daemon. Let e be the number of edges and let n be the number of nodes in a graph. The time complexity is O(e) moves. Therefore, the complexity is O(n) moves for trees or rings whose length is not a multiple of 3.
متن کاملA Space-Optimal Self-Stabilizing Algorithm for the Maximal Independent Set Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we propose a self-stabilizing algorithm for the maximal independent set problem in distributed systems assuming the state reading model under the distributed scheduler. Space complexity of proposed algorithm is two-state, and upper bound of time complexity is (n+ 2)(n+ 1)/4 steps, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 91 شماره
صفحات -
تاریخ انتشار 2004